Imprecise Task Schedule Optimization

نویسندگان

  • Chantana Chantrapornchai
  • Sissades Tongsima
  • Edwin H.-M. Sha
چکیده

Considerable research has been done in order to schedule tasks to a multiple processing systems. Some of the computation time of these tasks may, however, be imprecise due to the nature of the problem. In this paper, an imprecise task graph is used to model the problem where each node represents a task associated with its computation time. An algorithm, called rotation scheduling, is extended to handle the imprecise task scheduling and fuzzy arithmetic is used to estimate the size of a schedule. The goal of the algorithm is to give the optimized schedule as much as possible. The experiments showing the effectiveness of this approach are also presented. Keyword: Imprecise schedule, Fuzzy schedule, Schedule optimization, Rotation scheduling, Retiming This work was supported in part by the Royal Thai Government Scholarship.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multiprocessors Scheduling for Imprecise Computations in a Hard Real-Time Environment

This paper discusses the problem of scheduling mul-tiprocessors in a hard real-time environment allowing imprecise computations. When results of the desired quality cannot be produced in time, then intermediate, imprecise results of acceptable quality are accepted. In an imprecise computation model, a task may be terminated any time after it has produced an acceptable result. Such tasks are log...

متن کامل

Algorithms for Scheduling Imprecise Computations with Timing Constraints

We consider here the problem of scheduling tasks in the imprecise computation model to minimize the maximum error. Given a task system and a schedule of it, the maximum error of the task system is equal to the error of the task that has the largest error when the task system is executed according to the schedule. We describe two preemptive algorithms for scheduling on a processor n dependent ta...

متن کامل

Pre-scheduling and Scheduling of Task Graph on Homogeneous Multiprocessor Systems

Task graph scheduling is a multi-objective optimization and NP-hard problem. In this paper a new algorithm on homogeneous multiprocessors systems is proposed. Basically, scheduling algorithms are targeted to balance the two parameters of time and energy consumption. These two parameters are up to a certain limit in contrast with each other and improvement of one causes reduction in the othe...

متن کامل

Pre-scheduling and Scheduling of Task Graph on Homogeneous Multiprocessor Systems

Task graph scheduling is a multi-objective optimization and NP-hard problem. In this paper a new algorithm on homogeneous multiprocessors systems is proposed. Basically, scheduling algorithms are targeted to balance the two parameters of time and energy consumption. These two parameters are up to a certain limit in contrast with each other and improvement of one causes reduction in the othe...

متن کامل

Algorithms for Scheduling Real - Time Taskswith Input Error and End - to - End DeadlinesW

This paper describes algorithms for scheduling preemptive, imprecise, composite tasks in real time. Each composite task consists of a chain of component tasks, and each component task is made up of a mandatory part and an optional part. Whenever a component task uses imprecise input, the processing times of its mandatory and optional parts may become larger. The composite tasks are scheduled by...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997